Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench

摘要

Writing concurrent programs for shared memory multiprocessor systems is anightmare. This hinders users to exploit the full potential of multiprocessors.STM (Software Transactional Memory) is a promising concurrent programmingparadigm which addresses woes of programming for multiprocessor systems. In this paper, we implement BTO (Basic Timestamp Ordering), SGT(Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering)concurrency control protocols and build an STM(Software Transactional Memory)library to evaluate the performance of these protocols. The deferred writeapproach is followed to implement the STM. A SET data structure is implementedusing the transactions of our STM library. And this transactional SET is usedas a test application to evaluate the STM. The performance of the protocols isrigorously compared against the linked-list module of the Synchrobenchbenchmark. Linked list module implements SET data structure using lazy-list,lock-free list, lock-coupling list and ESTM (Elastic Software TransactionalMemory). Our analysis shows that for a number of threads greater than 60 and updaterate 70%, BTO takes (17% to 29%) and (6% to 24%) less CPU time per thread whencompared against lazy-list and lock-coupling list respectively. MVTO takes (13%to 24%) and (3% to 24%) less CPU time per thread when compared againstlazy-list and lock-coupling list respectively. BTO and MVTO have similar perthread CPU time. BTO and MVTO outperform SGT by 9% to 36%.